project portfolio selection with the maximization of net present value
نویسندگان
چکیده
projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. an integer programming model is formulated for the project portfolio selection and scheduling.two heuristic algorithms, genetic algorithm (ga) and simulated annealing (sa), are presented to solve the problem. results of calculations show that the algorithm performance of ga is better than sa in project portfolio selection to maximize the npv of the project portfolio.
منابع مشابه
Project Portfolio Selection with the Maximization of Net Present Value
Projects scheduling by the project portfolio selection, something that has its own complexity and its flexibility, can create different composition of the project portfolio. An integer programming model is formulated for the project portfolio selection and scheduling.Two heuristic algorithms, genetic algorithm (GA) and simulated annealing (SA), are presented to solve the problem. Results of cal...
متن کاملProject scheduling optimization for contractor’s Net present value maximization using meta-heuristic algorithms: A case study
Today's competitive conditions have caused the projects to be carried out in the least possible time with limited resources. Therefore, managing and scheduling a project is a necessity for the project. The timing of a project is to specify a sequence of times for a series of related activities. According to their priority and their latency, so that between the time the project is completed and ...
متن کاملProject Scheduling with Simultaneous Optimization, Time, Net Present Value, and Project Flexibility for Multimode Activities with Constrained Renewable Resources
Project success is assessed based on various criteria, every one of which enjoys a different level of importance for the beneficiaries and decision makers. Time and cost are the most important objectives and criteria for the project success. On the other hand, reducing the risk of finishing activities until the predetermined deadlines should be taken into account. Having formulated the problem ...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...
متن کاملMaximising the Net Present Value for Resource-Constrained Project Scheduling
The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow...
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
journal of optimization in industrial engineeringناشر: qiau
ISSN 2251-9904
دوره 6
شماره 12 2013
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023